This paper presents a bi-objective MIP model for the flexible flow shop scheduling  problem (FFSP) in which the total weighted tardiness and the energy consumption are minimized simultaneously. In addition to considering unrelated machines at each stage, the set-up times are supposed to be sequence- and machine-dependent, and it is assumed that jobs have different release tim...

This article proposes a novel Pareto-based multiobjective meta-heuristic algorithm named non-dominated ranking genetic algorithm (NRGA) to solve multi-facility location-allocation problem. In NRGA, a fitness value representing rank is assigned to each individual of the population. Moreover, two features ranked based roulette wheel selection including select the fronts and choose solutions from ...

The hub location problem is employed for many real applications, including delivery, airline and telecommunication systems and so on. This work investigates on hierarchical hub network in which a three-level network is developed. The central hubs are considered at the first level, at the second level, hubs are assumed which are allocated to central hubs and the remaining nodes are at the third ...

In industries machine maintenance is used in order to avoid untimely machine fails as well as to improve production effectiveness. This research regards a permutation flow shop scheduling problem with aging and learning effects considering maintenance process. In this study, it is assumed that each machine may be subject to at most one maintenance activity during the planning horizon. The objec...

In today’s competitive world, the need to supply chain management (SCM) is more than ever. Since the purpose of logistic problems is minimizing the costs of organization to create favorable time and place for the products, SCM seek to create competitive advantage for their organizations and increase their productivity. This paper proposes a new multi-objective model for integrated forward / rev...

Evolutionary algorithms are becoming increasingly valuable in solving large-scale, realistic engineering multiobjective optimization problems, which typically require consideration of conflicting and competing design issues. A criticism of Evolutionary Algorithms might be the lack of efficient and robust generic methods to handle constraints. The most widespread approach for constrained search ...

Multi-objective evolutionary algorithms (EAs) that use non-dominated sorting and sharing have been criticized. Mainly for their: 1) ( 3 MN O computational complexity (where M is the number of objectives and N is the population size). 2Non-elitism approach; 3-the need for specifying a sharing parameter. In this paper, a method combining the new Ranked based Roulette Wheel selection algorithm wit...

in this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the p-mmrcpsp while due dates are included i...

In this paper, a bi-objective multi-product (r,Q) inventory model in which the inventory level is reviewed continuously is proposed. The aim of this work is to find the optimal value for both order quantity and reorder point through minimizing the total cost and maximizing the service level of the proposed model simultaneously. It is assumed that shortage could occur and unsatisfied demand coul...

In this paper, a novel mathematical model for a preemption multi-mode multi-objective resource-constrained project scheduling problem with distinct due dates and positive and negative cash flows is presented. Although optimization of bi-objective problems with due dates is an essential feature of real projects, little effort has been made in studying the P-MMRCPSP while due dates are included i...